Classical algorithm for quantum SU(2) Schur sampling
نویسندگان
چکیده
منابع مشابه
Perfect sampling algorithm for Schur processes
We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tili...
متن کاملA categorical approach to classical and quantum Schur–Weyl duality
We use category theory to propose a unified approach to the Schur–Weyl dualities involving the general linear Lie algebras, their polynomial extensions and associated quantum deformations. We define multiplicative sequences of algebras exemplified by the sequence of group algebras of the symmetric groups and use them to introduce associated monoidal categories. Universal properties of these cat...
متن کاملq-FUZZY SPHERES AND QUANTUM DIFFERENTIALS ON Bq[SU2] AND Uq(su2)
We show that the 2-parameter Podles sphere is a q-fuzzy sphere precisely interpolating between the fuzzy sphere as quotient of the angular momentum algebra U(su2) and the standard q-sphere Cq [S] as subalgebra of the quantum group Cq [SU2]. Whereas the classical sphere as CP 1 can be defined as the algebra generated by the matrix entries of a projector e with trace(e) = 1, the fuzzy-sphere is d...
متن کاملQuantum algorithm for exact Monte Carlo sampling.
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact Monte Carlo sampling methods, and yields a polynomial gain compared to classical procedures.
متن کاملA Krylov-Schur Algorithm for Matrix Products?
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which employs reordered Schur decompositions to perform restarts and deflations in a numerically reliable manner. This paper describes a variant of the Krylov-Schur algorithm suitable for addressing eigenvalue problems associated with products of large and sparse matrices. It per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2019
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.99.062336